Formalization of Phase Ordering
نویسندگان
چکیده
Phasers pose an interesting synchronization mechanism that generalizes many collective synchronization patterns seen in parallel programming languages, including barriers, clocks, and point-topoint synchronization using latches or semaphores. This work characterizes scheduling constraints on phaser operations, by relating the execution state of two tasks that operate on the same phaser. We propose a formalization of Habanero phasers, May-Happen-In-Parallel, and Happens-Before relations for phaser operations, and show that these relations conform with the semantics. Our formalization and proofs are fully mechanized using the Coq proof assistant, and are available online.
منابع مشابه
A Framework for Formalization and Strictness Analysis of Simulation Event Orderings
This paper advocates the use of a formal framework for analyzing simulation performance. Simulation performance is characterized based on the three simulation development process boundaries: physical system, simulation model, and simulator implementation. Firstly, we formalize simulation event ordering using partially ordered set theory. A simulator implements a simulation event ordering, and i...
متن کاملOn the Formalization of Termination Techniques based on Multiset Orderings
Multiset orderings are a key ingredient in certain termination techniques like the recursive path ordering and a variant of size-change termination. In order to integrate these techniques in a certifier for termination proofs, we have added them to the Isabelle Formalization of Rewriting. To this end, it was required to extend the existing formalization on multiset orderings towards a generaliz...
متن کاملA Formalization of the Simply Typed Lambda Calculus in Coq
In this paper we present a formalization of the simply typed lambda calculus with constants and with typing à la Church. It has been accomplished using the theorem prover Coq. The formalization includes, among other results, definitions of typed terms over arbitrary many-sorted signature, a substitution operating on typing judgements, an equivalence relation generalizing the concept of α-conver...
متن کاملFormalization and Proof of a Solution to the PCI 2.1 Bus Transaction Ordering Problem
The transaction ordering problem of the original PCI 2.1 standard bus speciication violates the desired correctness property of maintaining the so called`Producer/Consumer' relationship between writers and readers. In 3], a correction to this ordering problem was proposed and informally proved (called the \HP solution" here). In this paper, we present a formalization of the PCI 2.1 protocol in ...
متن کاملCertified Higher-Order Recursive Path Ordering
Recursive path ordering (RPO) is a well-known reduction ordering introduced by Dershowitz [6], that is useful for proving termination of term rewriting systems (TRSs). Jouannaud and Rubio generalized this ordering to the higher-order case thus creating the higher-order recursive path ordering (HORPO) [8]. They proved that this ordering can be used for proving termination of higher-order TRSs wh...
متن کامل